Evolutionary-Computation Based Risk Assessment of Aircraft Landing Sequencing Algorithms

Usually, Evolutionary Computation (EC) is used for optimisation and machine learning tasks. Recently, a novel use of EC has been proposed – Multiobjective Evolutionary Based Risk Assessment (MEBRA). MEBRA characterises the problem space associated with good and inferior performance of computational algorithms. Problem instances are represented (“scenario Representation”) and evolved (“scenario Generation”) in order to evaluate algorithms (“scenario Evaluation”). The objective functions aim at maximising or minimising the success rate of an algorithm. In the “scenario Mining” step, MEBRA identifies the patterns common in problem instances when an algorithm performs best in order to understand when to use it, and in instances when it performs worst in order to understand when not to use it. So far, MEBRA has only been applied to a limited number of problems. Here we demonstrate its viability to efficiently detect hot spots in an algorithm's problem space. In particular, we apply the basic MEBRA rationale in the area of Air Traffic Management (ATM). We examine two widely used algorithms for Aircraft Landing Sequencing: First Come First Served (FCFS) and Constrained Position Shifting (CPS). Through the use of three different problem (“scenario”) representations, we identify those patterns in ATM problems that signal instances when CPS performs better than FCFS, and those when it performs worse. We show that scenario representation affects the quality of MEBRA outputs. In particular, we find that the variable-length chromosome representation of aircraft scheduling sequence scenarios converges fast and finds all relevant risk patterns associated with the use of FCFS and CPS.